Function of One Regular Separable Relation Set Decided for the Minimal Covering in Multiple Valued Logic
نویسندگان
چکیده
منابع مشابه
Computing the minimal covering set
We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) tournament. The algorithm is based on a linear programming formulation of a subset of the minimal covering set known as the essential set. On the other hand, we show that no efficient algorithm exists for two variants of the minimal covering set, the minimal upward covering set and the minimal down...
متن کاملAlternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کاملThe minimal covering set in large tournaments
We prove that in almost all large tournaments, the minimal covering set is the entire set of alternatives. That is, as the number of alternatives gets large, the probability that the minimal covering set of a uniformly chosen random tournament is the entire set of alternatives goes to one. By contrast, it follows from a result of Fisher and Reeves (1995) that the bipartisan set contains about h...
متن کاملstudy of cohesive devices in the textbook of english for the students of apsychology by rastegarpour
this study investigates the cohesive devices used in the textbook of english for the students of psychology. the research questions and hypotheses in the present study are based on what frequency and distribution of grammatical and lexical cohesive devices are. then, to answer the questions all grammatical and lexical cohesive devices in reading comprehension passages from 6 units of 21units th...
Covering numbers for real-valued function classes
As a byproduct of Theorem 3.1 we can give an estimate of the truncation error which arises if one ignores all the samples outside a finite interval. More precisely, we have the following corollary. Theorem 4.1: Let us define the truncation error E N (t) as follows: E N (t) = F(t) 0 jnjN F (t n)S n (t): Then jE N (t)j 2 2p0q bA p C ^ (1 0 p D)(p 0 q 0 1)N p0q01 ; t in the compact set K (14) wher...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATEC Web of Conferences
سال: 2016
ISSN: 2261-236X
DOI: 10.1051/matecconf/20166304036